covering problem
英 [ˈkʌvərɪŋ ˈprɒbləm]
美 [ˈkʌvərɪŋ ˈprɑːbləm]
网络 覆盖问题
双语例句
- On the proof of the NP-completeness of key covering problem in the group rekeying;
覆盖问题是传感器网络中的基础性问题，着重研究了一类特殊的覆盖问题&栅栏覆盖问题。 - A Study of Reduction of Attributes and Set Covering Problem;
条件属性约简是粗糙集理论算法研究的重点。 - A Hybrid Genetic Algorithm for Solving Minimum Vertices Covering Problem
一种求解图最小顶点覆盖问题的混合遗传算法 - Study on the Covering Problem for Functional Dependency with Totally Ordered Temporal Scheme
全序时态模式下函数依赖集覆盖问题的研究 - Application of Population-based Incremental Learning Algorithm in Solving Code Covering Problem
应用基因概率学习算法求解最小码覆盖问题 - Solving Point Covering Problem by ant-algorithm
点覆盖问题的蚂蚁算法求解 - A geometrical representation of M-P model is firstly introduced, by which the training problem of neural networks may be transformed into the covering problem of a point set. According to this, the geometrical algorithm of neural network training is analyzed.
首先介绍了一种M-P模型几何表示，以及利用这种几何表示可将神经网络的训练问题转化为点集覆盖问题，并在此基础上分析了神经网络训练的一种几何方法。 - In this paper, the cover-most algorithm is improved into a method of solving the covering problem for the multiple-output switching functions, the solution so obtained is near the minimum one, and the associated computational time is available.
文中将覆盖最多点法扩展、改进成为求解多输出函数覆盖问题的方法，能得到一个接近最小造价的解，在时间和最小性方面都切实可行，并可用于PLA的程序设计。 - Designing a simulative model for the forecast and optimal placement of casualty evacuation assets based on the probabilistic location set covering problem
基于随机性集合覆盖模型的伤病员后送运力预计及优化配置仿真模型设计 - Two approaches arc given to solve the neighborhood covering problem in strongly chordal graphss. One is to reduce it to the clique covering problem. The other is to reduce it to a linear programming problem, which can be solved in polynomial time by a combinatorial method.
对强弦图上的邻域复盖问题，本文提出两条求解途径：一是化为弦图上的团复盖问题，一是化为可用组合方法求解的线性规划问题。 - In this paper, a logical-tool-based cutting tool preparing ( LTCTP) method for machine center is proposed. A logical tool refers to a certain class of demanded cutting tools in numerical control ( NC) program and can be obtained using a method for set covering problem.
本文从刀具的组成特点出发，提出了基于逻辑刀具的刀具选配方法，把某些可以归为一类的需求刀具用一个逻辑刀具来代替，通过集合覆盖方法求解逻辑刀具。 - On a Covering Problem
一个覆盖问题 - An Improved Sticker Model of the Minimal Covering Problem
最小顶点覆盖问题的改进粘贴模型 - Study on genetic algorithm application in set covering problem
一种遗传算法在集合覆盖问题中的应用研究 - The Multi-allocation Hub Maximal Covering Problem
多分配枢纽站最大覆盖选址问题 - The training problem of neural networks is transformed into the geometrical covering problem of a point set by the sphere neighborhood model, which is based on a geometrical representation of MP neural model.
该方法应用基于几何意义的MP神经网络模型&球面邻域模型，将神经网络的训练问题转化为点集覆盖的问题。 - Combinational Analysis for a Class of Set Covering Problem
一类覆盖问题的组合学分析 - Finally, the solution of the minimal covering problem on surface using fluorescence marking technology is proposed based on the principle of sticker model.
最后我们利用粘贴模型的基本原理，运用荧光标记技术，提出了最小顶点覆盖问题的表面技术解决方案。 - Semidefinite Relaxation Algorithm of Bin Covering Problem
箱覆盖问题的半定松驰算法 - Covering reduction is an efficient way of research on simplifying covering problem.
覆盖约简是研究覆盖去冗余问题的一种有效方法。 - In this paper, a nonconvex covering problem in one dimension is dis-cussed.
本文讨论了一维空间中的非凸复盖问题。 - Minimum cardinality bin covering problem and its heuristic algorithm
最小基数箱子覆盖问题及其启发式算法 - The paper proposes a new model for the multiple allocation hub maximal covering problem, then provides a greedy add-substitute heuristic algorithm.
建立了一个多分配枢纽站最大覆盖问题的改进模型，并给出了贪婪相加-替代的启发式算法。 - For the first time Red Laser Diode ( RLD) was used as light source to develop a laser beam grid sensor for monitoring seeding distribution. Hence, monitoring covering problem is solved and monitoring precision percentage was improved.
首次使用可见光激光二极管（RLD）为光源制作了用于排种均匀度检测的激光束栅格光电传感器，解决了传感器检测覆盖率问题，提高了检测准确率。 - We also discuss covering problem, integral mean. And some applications to starlike and convex functions have been gotten.
我们还讨论了覆盖问题、积分平均和在星形函数族中的应用。 - Point covering problem is hard to solve with great actual value.
点覆盖问题是一个重要的有实际意义的难解问题。 - In this paper, basic concepts and basic bio-chemistry experiments of a model of closed circle DNA computing are brought forward. Closed circle DNA algorithm of the minimal covering problem is put forward.
提出了闭环DNA计算模型的基本概念及其基本生化实验，并给出了解决最小顶点覆盖问题的闭环DNA算法。 - Third, municipal engineering are mostly old engineering renovation and new construction at the same time, face a lot of demolition, land acquisition or covering problem.
其三，市政工程大多是旧工程拆迁改造与新工程施工同时进行，面临许多拆迁、征地或占地的问题。 - Facility location problems, which can be divided into three kinds or more, covering problem, p-center problem, p-median problem, etc. according to classical location theory, are frequently encountered in urban planning.
设施选址问题是城市规划中经常遇到的问题，根据选址理论的典型模型，可将其分为覆盖问题、p中心问题和p中位问题三类。 - It has been successfully applied in many complicated optimization problem such as TSP, assignment problem, scheduling problem, set covering problem.
它在求解复杂组合优化问题上显示出强大的优势，已经成功解决过旅行商问题、分配问题、调度问题和集合覆盖问题等。